Hull number: P5-free graphs and reduction rules
نویسندگان
چکیده
منابع مشابه
Hull number: P5-free graphs and reduction rules
In this paper, we study the (geodesic) hull number of graphs. For any two vertices u, v ∈ V of a connected undirected graph G = (V,E), the closed interval I[u, v] of u and v is the set of vertices that belong to some shortest (u, v)-path. For any S ⊆ V , let I[S] = ⋃ u,v∈S I[u, v]. A subset S ⊆ V is (geodesically) convex if I[S] = S. Given a subset S ⊆ V , the convex hull Ih[S] of S is the smal...
متن کاملWeighted Parameters in (P5, P5)-free Graphs
We use the modular decomposition to give O(n(m + n)) algorithms for finding a maximum weighted clique (respectively stable set) and an approximate weighted colouring (respectively partition into cliques) in a (P5, P5)-free graph. As a by-product, we obtain an O(m+n) algorithm for finding a minimum weighted transversal of the C5 in a (P5, P5)free graph.
متن کاملThe Domination number of (Kp, P5)-free graphs
We prove that, for each p ≥ 1, there exists a polynomial time algorithm for finding a minimum domination set in the class of all (Kp, P5)-free graphs. Let G be a graph with vertex-set V (G) and edge-set E(G). The notation x ∼ y (respectively, x 6∼ y) means that vertices x, y ∈ V (G) are adjacent (respectively, non-adjacent). Moreover, if X ⊆ V (G) and y ∈ V (G)\X, we write y ∼ X (respectively, ...
متن کاملOn (P5, diamond)-free graphs
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...
متن کاملChoosability of P5-Free Graphs
A graph is k-choosable if it admits a proper coloring of its vertices for every assignment of k (possibly different) allowed colors to choose from for each vertex. It is NP-hard to decide whether a given graph is k-choosable for k ≥ 3, and this problem is considered strictly harder than the k-coloring problem. Only few positive results are known on input graphs with a given structure. Here, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.03.019